A combination of penalty function and multiplier methods for solving optimal control problems

The properties of combined multiplier and penalty function methods are investigated using a second-order expansion and results known for the Riccati equation. It is shown that the lower bound of the values of the penalty constant necessary to obtain a minimum is given by a certain Riccati equation. The convergence rate of a common updating rule for the multipliers is shown to be linear.This work has been supported by the Swedish Institute of Applied Mathematics.     

旅行商问题的基因整合算法

本文针对旅行商问题提出了基因整合算法。它是通过设置扰动矩阵构造与原商问题等价的近似问题，使用最优罚函数选择回路分枝得到一系列局部最优回路，从中提取频度高的分技——基因进行整合，得到更优的回路。该算法计算量小，对大规模问题计算效果显著。利用该算法对CHN144问题给出了目前最件的结果。     

uv-理论在一类半无限最小化问题的应用

Lemarechal,Oustry和Sagastizabal(2000)提出的uv分解理论为解决非光滑函数的高阶展开提供了一种新的途径，并将此理论应用于研究具有有限个约束的非线性规划的精确罚函数．本文将这一研究推广到具有无限约束的一类半无限规划的问题上，并给出了与这类最小化问题的精确罚函数的U-Lagrange函数有关的某些结果．     

带有不等式约束的全局最优性条件

本文利用不连续罚函数方法将带有不等式约束的全局优化问题的求解转化为 讨论一非线性方程的求根问题,从而得到若干个全局最优性条件.     

目标约束下的投资选择

根据 Markowitz投资组合理论和传统的期望效用理论 ,在效用函数相同的情况下 ,所有的理性投资者都将采用相同的最优投资策略 .但在现实中 ,不同的投资者往往采用不同的投资策略 ,依据传统理论只能认为他们并不都是理性投资者 .本文引入了目标约束后 ,说明了由于不同的投资者具有不同的目标约束 ,所以用传统的期望效用理论无法解释的看似非理性的行为其实却是理性的最优选择 .     

参数的E Bayes估计法及其应用

提出了参数的一种估计方法—— E Bayes估计法 ,对寿命服从指数分布的产品 ,在失效率的先验分布为 Gamma分布时 ,给出了失效率的 E Bayes估计和多层 Bayes估计 ,并在此基础上给出了失效率和可靠度的 E Bayes估计的性质 .结合实际问题进行了计算 ,结果表明提出的 E Bayes估计法可行且便于应用 .     

On Information Processes in Statistical Experiments with Distributed Observations

Using stochastic integration theory in topological vector spaces general formulas for the Hellinger processes are derived. Feynman–Kac type formulas are obtained for the related Hellinger integrals in terms of the Hellinger processes and the geometric mean measures. The expected logarithmic utility from data, characterized as the Shannon information, is also considered.     

Partially Strictly Monotone and Nonlinear Penalty Functions for Constrained Mathematical Programs

We introduce the concept of partially strictly monotone functions and apply it to construct a class of nonlinear penalty functions for a constrained optimization problem. This class of nonlinear penalty functions includes some (nonlinear) penalty functions currently used in the literature as special cases. Assuming that the perturbation function is lower semi-continuous, we prove that the sequence of optimal values of nonlinear penalty problems converges to that of the original constrained optimization problem. First-order and second-order necessary optimality conditions of nonlinear penalty problems are derived by converting the optimality of penalty problems into that of a smooth constrained vector optimization problem. This approach allows for a concise derivation of optimality conditions of nonlinear penalty problems. Finally, we prove that each limit point of the second-order stationary points of the nonlinear penalty problems is a second-order stationary point of the original constrained optimization problem.     

A new augmented penalty function technique for optimal control problems

This note presents an extension of the Miele—Cragg-Iyer-Levy augmented function method for finite-dimensional optimization problems to optimal control problems. A numerical study is provided.     

An Infeasible Point Method for Minimizing the Lennard-Jones Potential

Minimizing the Lennard-Jones potential, the most-studied modelproblem for molecular conformation, is an unconstrained globaloptimization problem with a large number of local minima. In thispaper, the problem is reformulated as an equality constrainednonlinear programming problem with only linear constraints. Thisformulation allows the solution to approached through infeasibleconfigurations, increasing the basin of attraction of the globalsolution. In this way the likelihood of finding a global minimizeris increased. An algorithm for solving this nonlinear program isdiscussed, and results of numerical tests are presented.